Partial instantiation theorem proving for distributed resource location
نویسندگان
چکیده
In this paper, we present a partial instantiation theorem prover (INSTANT) which handles sentences in first-order logic in clausal or non-clausal form. INSTANT uses a variant of the GSAT algorithm for determining the satisfiability of a propositional sentence to increase its speed. The algorithm used in INSTANT can be parallelized with good speedup to improve performance. INSTANT is designed for matching requests for resources with available resources over a network. Environments in which distributed resource location takes place through matching of requests and advertisements include CORBA’s Object Trading Service and communication between agents using KIF and KQML.
منابع مشابه
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reasoning, several similarity concepts, a cooperation concept of distributed AI and reactive planning enables a system to learn from previous successful proof attempts. In a kind of bootstrapping process easy problems are u...
متن کاملAn Isabelle-Based Theorem Prover for VDM-SL
This paper describes the theorem proving component of a larger software development environment for the ISO standardized spec-iication language VDM-SL. This component is constructed as an instan-tiation of the generic theorem prover Isabelle with a VDM-SL variant of the Logic of Partial Functions (LPF). We describe the development of this instantiation, focusing on both the embedding of syntax ...
متن کاملCentre for Intelligent Systems and their Applications A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers
The role of decision procedures is often essential in theorem proving. Decision procedures can reduce the search space of heuristic components of a prover and increase its abilities. However, in some applications only a small number of conjectures fall within the scope of the available decision procedures. Some of these conjectures could in an informal sense fall ‘just outside’ that scope. In t...
متن کاملA Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers
The role of decision procedures is often essential in theorem proving. Decision procedures can reduce the search space of heuristic components of a prover and increase its abilities. However, in some applications only a small number of conjectures fall within the scope of the available decision procedures. Some of these conjectures could in an informal sense fall ‘just outside’ that scope. In t...
متن کاملNew Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We give a model construction proof of completeness by which restrictive inference systems as well as admissible simplification techniques can be justified. Another contribution of the paper are novel inference systems that ...
متن کامل